Excited State Search Using Quantum Annealing

نویسندگان

چکیده

Quantum annealing (QA) is one of the ways finding ground states problem Hamiltonians. We initially apply transverse fields corresponding to a driver Hamiltonian and adiabatically change obtain target state. However, for some purposes such as quantum chemistry, both excited are needed understand properties molecules. Here, we describe scheme based on QA search arbitrary By splitting degeneracy with inhomogeneous fields, can prepare nondegenerate state initial state, an adiabatic provides long condition holds. also show that our enables us find desired by designing suitably even in presence weak decoherence. These results important chemistry post-quantum cryptography.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Excited-state relaxation in PbSe quantum dots.

In solids the phonon-assisted, nonradiative decay from high-energy electronic excited states to low-energy electronic excited states is picosecond fast. It was hoped that electron and hole relaxation could be slowed down in quantum dots, due to the unavailability of phonons energy matched to the large energy-level spacings ("phonon-bottleneck"). However, excited-state relaxation was observed to...

متن کامل

A Mushy State Simulated Annealing

It is a long time that the Simulated Annealing (SA) procedure has been introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules...

متن کامل

Bayesian Network Structure Learning Using Quantum Annealing

We introduce a method for the problem of learning the structure of a Bayesian network using the quantum adiabatic algorithm. We do so by introducing an efficient reformulation of a standard posteriorprobability scoring function on graphs as a pseudo-Boolean function, which is equivalent to a system of 2-body Ising spins, as well as suitable penalty terms for enforcing the constraints necessary ...

متن کامل

Singular-value decomposition using quantum annealing.

In the present study, we demonstrate how to perform, using quantum annealing, the singular value decomposition and the principal component analysis. Quantum annealing gives a way to find a ground state of a system, while the singular value decomposition requires the maximum eigenstate. The key idea is to transform the sign of the final Hamiltonian, and the maximum eigenstate is obtained by quan...

متن کامل

A Mushy State Simulated Annealing

It is a long time that the Simulated Annealing (SA) procedure is introduced as a model-free optimization for solving NP-hard problems. Improvements from the standard SA in the recent decade mostly concentrate on combining its original algorithm with some heuristic methods. These modifications are rarely happened to the initial condition selection methods from which the annealing schedules start...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Physical Society of Japan

سال: 2021

ISSN: ['0031-9015', '1347-4073']

DOI: https://doi.org/10.7566/jpsj.90.054002